On the Strongly Regular Graph of Parameters
نویسنده
چکیده
In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we studied its possible substructure and constructions.
منابع مشابه
CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملGeneralized Krein Parameters of a Strongly Regular Graph
We consider the real three-dimensional Euclidean Jordan algebra associated to a strongly regular graph. Then, the Krein parameters of a strongly regular graph are generalized and some generalized Krein admissibility conditions are deduced. Furthermore, we establish some relations between the classical Krein parameters and the generalized Krein parameters.
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملNew strongly regular graphs from switching of edges
By Seidel’s switching, we construct new strongly regular graphs with parameters (276, 140, 58, 84). In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let G = (V,E) be a primitive strongly regular graph with parameters (v, k, λ, μ). Let S(G,H) be the graph from G by switching with respect to a nonempty H ⊂ V . Suppose v = 2(k − θ1) where θ1 is the nont...
متن کاملer 10 82 ON A FAMILY OF STRONGLY REGULAR GRAPHS WITH λ = 1 ANDRIY
In this paper, we give a complete description of strongly regular graphs with parameters ((n + 3n − 1), n(n + 3), 1, n(n + 1)). All possible such graphs are: the lattice graph L3,3 with parameters (9, 4, 1, 2), the Brouwer-Haemers graph with parameters (81, 20, 1, 6), and the Games graph with parameters (729, 112, 1, 20).
متن کامل